Cospectral Graphs on 12 Vertices
نویسندگان
چکیده
We found the characteristic polynomials for all graphs on 12 vertices, and report statistics related to the number of cospectral graphs.
منابع مشابه
Enumeration of cospectral graphs
We have enumerated all graphs on at most 11 vertices and determined their spectra with respect to various matrices, such as the adjacency matrix and the Laplacian matrix. We have also counted the numbers for which there is at least one other graph with the same spectrum (a cospectral mate). In addition we consider a construction for pairs of cospectral graphs due to Godsil and McKay, which we c...
متن کاملConstructing cospectral graphs for the normalized Laplacian
We give a method to construct cospectral graphs for the normalized Laplacian by swapping edges between vertices in some special graphs. We also give a method to construct an arbitrarily large family of (non-bipartite) graphs which are mutually cospectral for the normalized Laplacian matrix of a graph. AMS 2010 subject classification: 05C50
متن کاملCospectral Graphs and Regular Orthogonal Matrices of Level 2
For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into a graph Γ′ with adjacency matrix A′, defined by A′ = Q > AQ, where Q is a regular orthogonal matrix of level 2 (that is, Q > Q = I, Q1 = 1, 2Q is integral, and Q is not a permutation matrix). If such an operation exists, and Γ is nonisomorphic with Γ′, then we say that Γ′ is semi-isomorphic with Γ. Semiis...
متن کاملOn the spectral characterization of some unicyclic graphs
Let H(n; q, n1, n2) be a graph with n vertices containing a cycle Cq and two hanging paths Pn1 and Pn2 attached at the same vertex of the cycle. In this paper, we prove that except for the A-cospectral graphs H(12; 6, 1, 5) and H(12; 8, 2, 2), no two non-isomorphic graphs of the form H(n; q, n1, n2) are A-cospectral. It is proved that all graphs H(n; q, n1, n2) are determined by their L-spectra...
متن کاملA construction of distance cospectral graphs
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in their edge counts yet are cospectral with respect to the distance matrix. Further, we identify a subgraph switching behavior which constructs additional dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009